Recovering the Graphical Structures via Knockoffs
نویسندگان
چکیده
منابع مشابه
Familywise Error Rate Control via Knockoffs
We present a novel method for controlling the k-familywise error rate (k-FWER) in the linear regression setting using the knockoffs framework first introduced by Barber and Candès. Our procedure, which we also refer to as knockoffs, can be applied with any design matrix with at least as many observations as variables, and does not require knowing the noise variance. Unlike other multiple testin...
متن کاملFamilywise Error Rate Control via Knockoffs
We present a novel method for controlling the k-familywise error rate (k-FWER) in the linear regression setting using the knockoffs framework first introduced by Barber and Candès. Our procedure, which we also refer to as knockoffs, can be applied with any design matrix with at least as many observations as variables, and does not require knowing the noise variance. Unlike other multiple testin...
متن کاملRecovering Logical Structures of Data
Many powerful parallelizing compiler techniques rely on the structures of data and code. Unfortunately, in many real applications, arrays do not have syntactic structures. In this paper, we show that logical data structures can be automatically recovered from the flat, one-dimensional arrays and accesses. We present a framework and algorithms for recovering the logical multi-dimensional data st...
متن کاملThe Graphical Condition for Identifying Arrows in Recovering Causal Structure
This paper deals with problems of recovering a causal structure by using not only conditional independence relationships but also prior knowledge when data are generated according to the causal structure among variables. Although some algorithms for recovering a causal structure based on independencies have been developed, the influence of prior knowledge on the recovery algorithms has not been...
متن کاملInferring graphical structures
We consider the problem of inferring the underlying graph using samples from a Markov random field defined on the graph. In particular, we consider the special but interesting case when the underlying graph comes from a distribution on sparse graphs. We provide matching upper and lower bounds for the sample-complexity of learning the underlying graph of a hard-core model, when the underlying gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2018
ISSN: 1877-0509
DOI: 10.1016/j.procs.2018.03.039